Stability of the linear complementarity problem properties under interval uncertainty

We consider the linear complementarity problem with uncertain data modeled by intervals, representing range of possible values. Many properties (such as solvability, uniqueness, convexity, finite number solutions etc.) are reflected constraint matrix. In order that has desired even in environment, we have to be able check them for all realizations interval data. This leads us robust matrices. particular, will discuss S-matrix, Z-matrix, copositivity, semimonotonicity, column sufficiency, principal nondegeneracy, \(R_0\)-matrix and R-matrix. characterize also suggest efficiently recognizable subclasses.